Existence and performance of Shalvi-Weinstein estimators

نویسندگان

  • Philip Schniter
  • Lang Tong
چکیده

The Shalvi–Weinstein (SW) criterion has become popular in the design of blind linear estimators of i.i.d. processes transmitted through unknown linear channels in the presence of unknown additive interference. Here, we analyze SW estimators in a general multiple-input multiple-output (MIMO) setting that allows near-arbitrary source/interference distributions and noisy noninvertible channels. The main contributions of this paper are i) simple tests for the existence of SW estimators for the desired source and ii) bounding expressions for the MSE of SW estimators that are a function of the minimum attainable MSE and the kurtoses of the source and interferers.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Geometrical characterizations of constant modulus receivers

Convergence properties of the constant modulus (CM) and the Shalvi–Weinstein (SW) algorithms in the presence of noise remain largely unknown. A new geometrical approach to the analysis of constant modulus and Shalvi–Weinstein receivers is proposed by considering a special constrained optimization involving norms of the combined channel-receiver response. This approach provides a unified framewo...

متن کامل

Domains of attraction of Shalvi-Weinstein receivers

Domains of attraction (DoA) of Shalvi–Weinstein (SW) receivers are analyzed. It is shown that there is a one-to-one correspondence between DoA in the receiver parameter space and those in the global (or combined channel-receiver) parameter space. For general noiseless channels, DoA of SW receivers in the global response space are the minimum distance decision regions on a unit sphere. In the pr...

متن کامل

On the equivalence between the Godard and Shalvi-Weinstein schemes of blind equalization

Certain equivalences between the Godard and Shalvi—Weinstein schemes have been previously noted under special circumstances. We present here a simple proof for real signals that an equivalence can be established assuming little more than stationarity to fourth order of the equalizer input; the exact nature of the input sequence proves otherwise irrelevant to the validity of the equivalence. The...

متن کامل

A gradient search interpretation of the super-exponential algorithm

This correspondence reviews the super-exponential algorithm proposed by Shalvi and Weinstein for blind channel equalization. The principle of this algorithm—Hadamard exponentiation, projection over the set of attainable combined channel-equalizer impulse responses followed by a normalization—is shown to coincide with a gradient search of an extremum of a cost function. The cost function belongs...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Signal Processing

دوره 49  شماره 

صفحات  -

تاریخ انتشار 2001